Fast exact string matching algorithms
نویسنده
چکیده
String matching is the problem of finding all the occurrences of a pattern in a text. We propose a very fast new family of string matching algorithms based on hashing q-grams. The new algorithms are the fastest on many cases, in particular, on small size alphabets. © 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Research Paper: Fast Exact String Pattern-matching Algorithms Adapted to the Characteristics of the Medical Language
OBJECTIVE The authors consider the problem of exact string pattern matching using algorithms that do not require any preprocessing. To choose the most appropriate algorithm, distinctive features of the medical language must be taken into account. The characteristics of medical language are emphasized in this regard, the best algorithm of those reviewed is proposed, and detailed evaluations of t...
متن کاملFast Algorithms for Exact String Matching
Given a pattern string P of length n and a query string T of length m, where the characters of P and T are drawn from an alphabet of size ∆, the exact string matching problem consists of finding all occurrences of P in T . For this problem, we present algorithms that in O(n∆) time preprocess P to essentially identify sparse(P ), a rarely occurring substring of P , and then use it to find occurr...
متن کاملTowards Faster String Matching
Aalto University, P.O. Box 11000, FI-00076 Aalto www.aalto.fi Author Hannu Peltola Name of the doctoral dissertation Towards Faster String Matching Publisher Aalto University School of Science Unit Department of Computer Science Series Aalto University publication series DOCTORAL DISSERTATIONS 78/2013 Field of research Software Technology Manuscript submitted 11 December 2012 Date of the defenc...
متن کاملEvaluation and Improvement of Fast Algorithms for Exact Matching on Genome Sequences
With the availability of large amounts of dna data, exact matching of nucleotide sequences has become an important application in modern computational biology and in meta-genomics. In the last decade several efficient solutions for the exact string matching problem have been developed and most of them are very fast in practical cases. However when the length of the pattern is short or the alpha...
متن کاملExact String Matching Animation in Java
We present an animation in Java for exact string matching algorithms 3]. This system provides a framework to animate in a very straightforward way any string matching algorithm which uses characters comparisons. Already 27 string matching algorithms have been animated with this system. It is a good tool to understand all these algorithms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 102 شماره
صفحات -
تاریخ انتشار 2007